On the Concatenations of Polar Codes and Non-Binary LDPC Codes
نویسندگان
چکیده
منابع مشابه
On the Minimum Distance of Non Binary LDPC Codes
Minimum distance is an important parameter of a linear error correcting code. For improved performance of binary Low Density Parity Check (LDPC) codes, we need to have the minimum distance grow fast with n, the codelength. However, the best we can hope for is a linear growth in dmin with n. For binary LDPC codes, the necessary and sufficient conditions on the LDPC ensemble parameters, to ensure...
متن کاملOn Multilevel Coding Schemes Based on Non-Binary LDPC Codes
We address the problem of constructing of coding schemes for the channels with high-order modulations. It is known, that non-binary LDPC codes are especially good for such channels and significantly outperform their binary counterparts. Unfortunately, their decoding complexity is still large. In order to reduce the decoding complexity we consider multilevel coding schemes based on non-binary LD...
متن کاملNon-Binary LDPC Codes and EXIT Like Functions
In the first part of this thesis we are interested in the asymptotic performance analysis of Non-Binary Low-Density Parity-Check (NBLDPC) codes over the Binary Erasure Channel (BEC) decoded via the suboptimal Belief Propagation (BP) decoder as well as the optimal Maximum-A-Posteriori (MAP) decoder. Previously, NBLDPC codes defined with respect to a finite field have been studied in the literatu...
متن کاملFourier Transform Decoding of Non-Binary LDPC Codes
Binary low-density parity-check (LDPC) codes have recently emerged as a promising alternative to turbo codes and have been shown to achieve excellent coding gains in AWGN channels. Non-binary LDPC codes have demonstrated improved performance over binary LDPC codes but their decoding is computationally intensive. Fourier transform decoding can reduce the decoding complexity but has a number of p...
متن کاملon the girth of tanner (3,7) quasi-cyclic ldpc codes
s. kim et al. have been analyzed the girth of some algebraically structured quasi-cyclic (qc) low-density parity-check (ldpc) codes, i.e. tanner $(3,5)$ of length $5p$, where $p$ is a prime of the form $15m+1$. in this paper, by extension this method to tanner $(3,7)$ codes of length $7p$, where $p$ is a prime of the form $21m+ 1$, the girth values of tanner $(3,7...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2018
ISSN: 2169-3536
DOI: 10.1109/access.2018.2877178